Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata
نویسندگان
چکیده
منابع مشابه
Bounded Model Checking for Weak Alternating Büchi Automata
We present an incremental bounded model checking encoding into propositional satisfiability where the property specification is expressed as a weak alternating Büchi automaton (WABA). The encoding is linear in the specification, or, more exactly O(|I|+ k · |T |+ k · |δ|), where |I| is the size of the initial state predicate, k is the bound, |T | is the size of the transition relation, and |δ| i...
متن کاملBounded Model Checking with SNF, Alternating Automata, and Bu"chi Automata
Model checking of LTL formulæ is traditionally carried out by a conversion to Büchi automata, and there is therefore a large body of research in this area including some recent studies on the use of alternating automata as an intermediate representation. Bounded model checking has until recently been apart from this, typically using a direct conversion from LTL to propositional logic. In this p...
متن کاملEfficient Model Checking Via Büchi Tableau Automata
This paper describes an approach to engineering efficient model checkers that are generic with respect to the temporal logic in which system properties are given. The methodology is based on the “compilation” of temporal formulas into variants of alternating tree automata called alternating Büchi tableau automata (ABTAs). The paper gives an efficient on-the-fly model-checking procedure for ABTA...
متن کاملBounded Model Checking for Weak Alternating Bu127 uchi Automata
We present an incremental bounded model checking encoding into propositional satisfiability where the property specification is expressed as a weak alternating Büchi automaton (WABA). The encoding is linear in the specification, or, more exactly O(|I|+ k · |T |+ k · |δ|), where |I| is the size of the initial state predicate, k is the bound, |T | is the size of the transition relation, and |δ| i...
متن کاملSimulation relations for alternating Büchi automata
We adapt direct, delayed, and fair simulation to alternating Büchi automata. Unlike with nondeterministic Büchi automata, naive quotients do not preserve the recognized language. As a remedy, we present specifically designed definitions of quotients, namely minimax and semi-elective quotients: minimax quotients, which are simple and have a minimum number of transitions, preserve the recognized ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.12.024